منابع مشابه
Fault-tolerant diameter for three family interconnection networks
Let G = (V ,E) be an k-connected graph. The (k − 1)-fault-tolerant diameter of G, denoted by Dk(G), is defined as Dk(G) = max{d(G − F)|F ⊂ V (G) and |F | = k − 1}, where G− F denotes the subgraph induced by V (G)− F . The fault-tolerant diameter is one important parameter for measuring the reliability and efficiency of interconnection networks. In this paper, we will give the bounds of fault-to...
متن کاملFault-diameter of the star-connected cycles interconnection network
Lel G be a graph with vertex connectivi2y k(G). An important measure of the fault tolerance of G is its faul&diameler df(G), which is defined as the maximum diameter resulting from the deletion of any set of nodes containing less than k(G) nodes. The robustness of G is often measured by comparing d/(G) with the diameter of Ihe fault-free G, namely d(G). In particular, a family of graphs G, is d...
متن کاملFault Location in Distributed Control Interconnection Networks
One class of networks suitable for use in parallel processing systems is the multistage cube network. Unfortunately, the cube network is not fault tolerant and any single failure within the network can prevent some sourcedestination communications. Cube networks with "extra" stages can be constructed that permit faults to be bypassed — providing the exact location of the fault is known. This pa...
متن کاملFault-Tolerant Multicasting in Multistage Interconnection Networks
In this paper, we study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerance multicasting, which employs the restricted header encoding...
متن کاملExtended-Fault Diameter of Mesh Networks
The diameter of a network in the presence of faulty nodes is an important indicator of its resilience. Certain popular topologies have been shown to possess fault diameters that are only one unit greater than those of the corresponding fault1ree networks, provided that the number of faults is strictly less than the network's connectivity. Examples of such robust networks include hypercubes, m-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1987
ISSN: 0898-1221
DOI: 10.1016/0898-1221(87)90085-x